package huawei.js2025;

import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

/**
 * 最长元音子串
 */
public class Question30 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int xcd = sc.nextInt();
        sc.nextLine();
        String line = sc.nextLine();

        // 找到所有的元音子串的位置
        List<Integer> yunyinPos = new ArrayList<>();
        for (int i = 0; i < line.length(); i++) {
            if (line.charAt(i) == 'a' || line.charAt(i) == 'e' || line.charAt(i) == 'i' || line.charAt(i) == 'o' || line.charAt(i) == 'u'
                    || line.charAt(i) == 'A' || line.charAt(i) == 'E' || line.charAt(i) == 'I' || line.charAt(i) == 'O' || line.charAt(i) == 'U') {
                yunyinPos.add(i);
            }
        }

        int l = 0, r = 1;
        int maxLen = 0;
        while (l < r && r < yunyinPos.size() ) {
            int start = yunyinPos.get(l);
            int end = yunyinPos.get(r);

            int cxcd = (end - start - 1) - (r - l - 1);

            if (cxcd == xcd) {
                System.out.println(line.substring(start, end + 1));
                maxLen = Math.max(maxLen, end - start + 1);
                r += 1;
            } else if (cxcd < xcd) {
                r += 1;
            } else {
                l += 1;
            }

            if (l == r) r += 1;
        }

        System.out.println(maxLen);
    }
}
